On Finite Representations of Infinite-State Behaviours
نویسنده
چکیده
We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the condition of strong regularity guarantees an existence of finite characterization in case of all equivalences of van Glabbeek’s hierarchy, and we also demonstrate that there are behaviours which are regular but not strongly regular w.r.t. all equivalences of the mentioned hierarchy except bisimilarity.
منابع مشابه
A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours
Process calculi for service-oriented computing often feature generation of fresh resources. So-called nominal automata have been studied both as semantic models for such calculi, and as acceptors of languages of finite words over infinite alphabets. In this paper we investigate nominal automata that accept infinite words. These automata are a generalisation of deterministic Muller automata to t...
متن کاملNominal deterministic omega automata
Nominal sets, presheaf categories, and named sets have successfully served as models of the state space of process calculi featuring resource generation. More recently, automata built in such categories have been studied as acceptors of languages of finite words over infinite alphabets. In this paper we investigate automata whose state spaces are nominal sets, and that accept infinite words. Th...
متن کاملAbstractions of hybrid systems: formal languages to describe dynamical behaviour ⋆
ions of hybrid systems: formal languages to describe dynamical behaviour ⋆ Rebekah Carter, Eva M. Navarro-López School of Computer Science, The University of Manchester Oxford Road, Manchester, M13 9PL, UK (e-mails: [email protected], [email protected]) Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical properties of hybrid systems. Th...
متن کاملOn the use of Automata-based Techniques in Symbolic Model Checking
At the heart of all the techniques that have been proposed for exploring infinite state spaces, is a symbolic representation that can finitely represent infinite sets of states. In early work on the subject, this representation was domain specific, for example linear constraints for sets of real vectors. For several years now, the idea that a generic finite-automaton based representation could ...
متن کاملProblems and Methods for Testing Infinite State Machines: Extended Abstract
There has been a lot of research on testing based on formal specifications, especially in the area of communication protocols. Most approaches take as starting point some finite model of the required behaviours of the system under test, such as Finite State Machines. This paper discusses the problems that arise when the underlying model of the specification is not finite.
متن کامل